package dp;

public class ClimbingStairs70 {
    // 不要想得太复杂了, dp[i-1]确实包含了dp[i-2]
    public int climbStairs(int n) {
        int[] dp = new int[n+1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i-2] + dp[i-1];
        }
        return dp[n];
    }
}
